Baron von Münchhausen
نویسندگان
چکیده
منابع مشابه
Cardinal Arithmetic in the Style of Baron von MüNchhausen
In this paper we show how to interpret Robinson’s Arithmetic Q and the theory R of Tarski, Mostowski and Robinson as theories of cardinals in very weak theories of relations over a domain. Bei der Verfolgung eines Hasen wollte ich mit meinem Pferd über einen Morast setzen. Mitten im Sprung musste ich erkennen, dass der Morast viel breiter war, als ich anfänglich eingeschätzt hatte. Schwebend in...
متن کاملBaron Münchhausen Redeems Himself: Bounds for a Coin-Weighing Puzzle
We investigate a coin-weighing puzzle that appeared in the 1991 Moscow Math Olympiad. We generalize the puzzle by varying the number of participating coins, and deduce an upper bound on the number of weighings needed to solve the puzzle that is noticeably better than the trivial upper bound. In particular, we show that logarithmically-many weighings on a balance suffice.
متن کاملNo swan song for Baron Justus von Liebig.
38. Ozek M, Uresin Y, Güngör M: Comparison of the effects of specific and nonspecific inhibition of nitric oxide synthase on morphine analgesia, tolerance and dependence in mice. Life Sci 2003; 72:1943–51 39. Toda N, Kishioka S, Hatano Y, Toda H: Modulation of opioid actions by nitric oxide signaling. Anesthesiology 2009; 110:166–81 40. Zhang J, Hoffert C, Vu HK, Groblewski T, Ahmad S, O’Donnel...
متن کاملBaron Münchhausen and the syndrome which bears his name: history of an endearing personage and of a strange mental disorder.
Munchausen syndrome, a mental disorder, was named in 1951 by Richard Asher after Karl Friedrich Hieronymus, Baron Münchhausen (1720-1797), whose name had become proverbial as the narrator of false and ridiculously exaggerated exploits. The first edition of Münchhausen's tales appeared anonymously in 1785 (Baron Münchausen's narrative of his marvelous travels and campaigns in Russia), and was wr...
متن کاملMünchhausen Matrices
“The Baron’s omni-sequence”, B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with distinct integer weights between 1 gram and n grams. A trivial lower bound on B(n) is log3 n, and it has been shown that B(n) is O(log n). We introduce new th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mayo Clinic Proceedings
سال: 1984
ISSN: 0025-6196
DOI: 10.1016/s0025-6196(12)60776-9